Enumeration of some optimal ternary constant-weight codes
نویسندگان
چکیده
We consider the problem of classification of optimal ternary constantweight codes. We use combinatorial and computer methods to find inequivalent codes for some cases for 3 ≤ d ≤ n ≤ 9.
منابع مشابه
Some Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملLinear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes
An optimal constant-composition or constant-weight code of weight has linear size if and only if its distance is at least . When , the determination of the exact size of such a constant-composition or constant-weight code is trivial, but the case of has been solved previously only for binary and ternary constant-composition and constant-weight codes, and for some sporadic instances. This paper ...
متن کاملOptimal ternary constant-composition codes with weight four and distance six
The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem of constructing optimal ternary constant-composition codes with Hamming weight four and minimum distance six. The problem is solved with a small number of len...
متن کاملOptimal ternary formally self-dual codes
In this paper, we study ternary optimal formally self-dual codes. Bounds for the highest minimum weight are given for length up to 30 and examples of optimal formally self-dual codes are constructed. For some lengths, we have found formally self-dual codes which have a higher minimum weight than any self-dual code. It is also shown that any optimal formally self-dual [ 10,5,5] code is related t...
متن کاملSome Unique Ternary Constant-composition Codes
The uniqueness of some ternary constant-composition codes is proved by combinato-rial methods. 1. Introduction. For all basic notions and facts about coding theory which are not introduced here we refer to [3]. All codes to be considered are ternary constant-composition codes. Ternary constant-composition (TCC) codes of length n are codes with constant composition of " zeros " , " ones " and " ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008